112 research outputs found
Graph homomorphisms between trees
In this paper we study several problems concerning the number of
homomorphisms of trees. We give an algorithm for the number of homomorphisms
from a tree to any graph by the Transfer-matrix method. By using this algorithm
and some transformations on trees, we study various extremal problems about the
number of homomorphisms of trees. These applications include a far reaching
generalization of Bollob\'as and Tyomkyn's result concerning the number of
walks in trees.
Some other highlights of the paper are the following. Denote by
the number of homomorphisms from a graph to a graph . For any tree
on vertices we give a general lower bound for by certain
entropies of Markov chains defined on the graph . As a particular case, we
show that for any graph ,
where is the
largest eigenvalue of the adjacency matrix of and is a
certain constant depending only on which we call the spectral entropy of
. In the particular case when is the path on vertices, we
prove that where
is any tree on vertices, and and denote the path and star on
vertices, respectively. We also show that if is any fixed tree and
for some tree on vertices, then
must be the tree obtained from a path by attaching a pendant
vertex to the second vertex of .
All the results together enable us to show that
|\End(P_m)|\leq|\End(T_m)|\leq|\End(S_m)|, where \End(T_m) is the set of
all endomorphisms of (homomorphisms from to itself).Comment: 47 pages, 15 figure
Positivity properties of Jacobi-Stirling numbers and generalized Ramanujan polynomials
Generalizing recent results of Egge and Mongelli, we show that each diagonal
sequence of the Jacobi-Stirling numbers \js(n,k;z) and \JS(n,k;z) is a
P\'olya frequency sequence if and only if and study the
-total positivity properties of these numbers. Moreover, the polynomial
sequences \biggl\{\sum_{k=0}^n\JS(n,k;z)y^k\biggr\}_{n\geq 0}\quad \text{and}
\quad \biggl\{\sum_{k=0}^n\js(n,k;z)y^k\biggr\}_{n\geq 0} are proved to be
strongly -log-convex. In the same vein, we extend a recent result of
Chen et al. about the Ramanujan polynomials to Chapoton's generalized Ramanujan
polynomials. Finally, bridging the Ramanujan polynomials and a sequence arising
from the Lambert function, we obtain a neat proof of the unimodality of the
latter sequence, which was proved previously by Kalugin and Jeffrey.Comment: 17 pages, 2 tables, the proof of Lemma 3.3 is corrected, final
version to appear in Advances in Applied Mathematic
Sidorenko's conjecture, colorings and independent sets
Let denote the number of homomorphisms from a graph to a
graph . Sidorenko's conjecture asserts that for any bipartite graph , and
a graph we have where
and denote the number of vertices and edges of the graph and
, respectively. In this paper we prove Sidorenko's conjecture for certain
special graphs : for the complete graph on vertices, for a
with a loop added at one of the end vertices, and for a path on vertices
with a loop added at each vertex. These cases correspond to counting colorings,
independent sets and Widom-Rowlinson colorings of a graph . For instance,
for a bipartite graph the number of -colorings
satisfies
In fact, we will prove that in the last two cases (independent sets and
Widom-Rowlinson colorings) the graph does not need to be bipartite. In all
cases, we first prove a certain correlation inequality which implies
Sidorenko's conjecture in a stronger form.Comment: Two references added and Remark 2.1 is expande
On two unimodal descent polynomials
The descent polynomials of separable permutations and derangements are both
demonstrated to be unimodal. Moreover, we prove that the -coefficients
of the first are positive with an interpretation parallel to the classical
Eulerian polynomial, while the second is spiral, a property stronger than
unimodality. Furthermore, we conjecture that they are both real-rooted.Comment: 16 pages, 4 figure
- âŠ